Ideal Whitehead graphs in Out(Fr). I. Some unachieved graphs
نویسندگان
چکیده
Masur and Smillie, 1993, proved precisely which singularity index lists arise from pseudo-Anosov mapping classes. In search of an analogous theorem for outer automorphisms of free groups, Handel and Mosher, 2011, ask: Is each connected, simplicial, (2r − 1)-vertex graph the ideal Whitehead graph of a fully irreducible φ ∈ Out(Fr)? We answer this question in the negative by exhibiting, for each r, examples of connected (2r-1)-vertex graphs that are not the ideal Whitehead graph of any fully irreducible φ ∈ Out(Fr). In the course of our proof we also develop machinery used in Pfaff, 2012, to fully answer the question in the rank-three case.
منابع مشابه
INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملSome Properties of the Nil-Graphs of Ideals of Commutative Rings
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices and are adjacent if and only if . Here, we study conditions under which is complete or bipartite. Also, the independence number of is deter...
متن کاملOn Eulerianity and Hamiltonicity in Annihilating-ideal Graphs
Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either E...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کامل